A two-stage algorithm for identification of nonlinear dynamic systems

This paper investigates the two-stage stepwise identification for a class of nonlinear dynamic systems that can be described by linear-in-the-parameters models, and the model has to be built from a very large pool of basis functions or model terms. The main objective is to improve the compactness of the model that is obtained by the forward stepwise methods, while retaining the computational efficiency. The proposed algorithm first generates an initial model using a forward stepwise procedure. The significance of each selected term is then reviewed at the second stage and all insignificant ones are replaced, resulting in an optimised compact model with significantly improved performance. The main contribution of this paper is that these two stages are performed within a well-defined regression context, leading to significantly reduced computational complexity. The efficiency of the algorithm is confirmed by the computational complexity analysis, and its effectiveness is demonstrated by the simulation results.     

Computational complexity of queries based on itemsets

We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete.     

Width-restricted layering of acyclic digraphs with consideration of dummy nodes

This paper deals with the problem of finding graph layerings restricted to a given maximal width. However, other than previous approaches for width-restricted layering, we take into account the space for dummy nodes, which are introduced by edges crossing a layer. The main result is that the problem of finding a width-restricted layering under consideration of dummy nodes is NP-complete even when all regular nodes have the same constant width and all dummy nodes have the same constant width.     

A space- and time-efficient local-spin spin lock

A simple code transformation is presented that reduces the space complexity of Yang and Anderson's local-spin mutual exclusion algorithm. In both the original and the transformed algorithm, only atomic read and write instructions are used; each process generates Θ(logN) remote memory references per lock request, where N is the number of processes. The transformed algorithm uses Θ(N) distinct variables, which is clearly optimal.     

Response coding and visuomotor transformation in the Simon task: The role of action goals.

Manual responses can be defined by differing response parameters. Any of them may generate a Simon effect. For all those response parameters, the same implementation of the Simon effect (in terms of subserving mechanism) is assumed. In 3 experiments, subjects had to respond with either fingers or sticks. Temporal properties of the Simon effect changed with response parameters relevant in a task. The Simon effect for manual responses decayed. For stick responses, in which the action goal differed from the anatomical mapping of the acting hand, a sustained Simon effect was observed. However, if the action goal for stick responses was not instrumental for selecting the correct response, the Simon effect decayed. The findings are consistent with the notion of different mechanisms involved in generating a Simon effect. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

BB. LJ系列流速记录仪的研制及应用

为满足缆道信号传输效率条件不同的测站要求,保证流速信号的可靠接收,安徽省水文局研制了BB.LJ系列流速记录仪。介绍了BB.LJ系列流速记录仪中流速测算、记录仪和水下编码信号源的原理、功能、技术特点,阐述了计算机和单片机技术,以及编、解码技术在水文仪器方面的应用。通过在安徽省10多个水文站的试用,论证了BB.LJ系列流速记录仪具有广泛的推广应用价值。     

A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs

We consider the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a setup time. A job completes when all of its operations have been processed. The objective is to minimize the number of tardy jobs. In the literature, this problem has been proved to be strongly NP-hard for arbitrary due-dates. We show in this paper that the problem remains strongly NP-hard even when the due-dates are common and all jobs have the same processing time.     

分形图像压缩的信源信道联合编码

本文针对分形图像压缩编码后所得各部分压缩数据的特点，分析了分形图像压缩各部分数据在传输中对传输信道干扰的敏感程度，并根据各部分数据对信道干扰的敏感程度的不同，提出了一种分形图像压缩的信源信道联合编码方法。仿真结果表明，采用所提出的分形图像压缩的信源信道联合编码方法后，分形图像压缩数据对传输信道的敏感程度降低，图像质量有较大提高。     

CAM中一类新的NP完全问题

本文提出了计算机辅助制造(CAM)中的一类作业调度问题并证明了它的NP完全性。     

基于通信信道的视频传输系统的设计

提出了一种利用PCM基群信道进行视频信号传输的方法,介绍了传输系统的工作原理,对视频编码器进行了较为详细的分析,并采用数字信号处理器作控制器,实现了视频信号的实时传输。